Parallel Complexity of Single Source Shortest Path Algorithms
نویسنده
چکیده
ALGORITHMS Mishra, P. K. Department of Applied Mathematics Birla Institute of Technology, Mesra Ranchi-835215 (India) & Dept. of Electronics & Electrical Communication Engineering Computer Vision Lab Indian Institute of Technology, Kharagpur West Bengal-721302 India Email: [email protected], [email protected] Abstract In this paper we have presented efficient parallel algorithms for all pair shortest paths problem and discussed the complexity of algorithms. The parallel complexity of algorithm achieves ( ) n O 2 log time when using ( ) n O processors in CRCW PRAM model. We achieve overall complexity of SSSP is ( ) n n O 2 log .
منابع مشابه
ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملApproximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملA Randomized Parallel Algorithm for Single-Source Shortest Paths
We give a randomized parallel algorithm for computing single-source shortest paths in weighted digraphs. We show that the exact shortest-path problem can be efficiently reduced to solving a series of approximate shortest-path subproblems. Our algorithm for the approximate shortest-path problem is based on the technique used by Ullman and Yannakakis in a parallel algorithm for breadth-first sear...
متن کاملParallel implementation of geometric shortest path algorithms
In application areas such as GIS, the Euclidean metric is often less meaningfully applied to determine a shortest path than metrics which capture, through weights, the varying nature of the terrain (e.g., water, rock, forest). Considering weighted metrics however increases the run-time of algorithms considerably suggesting the use of a parallel approach. In this paper, we provide a parallel imp...
متن کاملPerformance Analysis of Single-source Shortest Path Algorithms on Distributed-memory Systems
We consider the problem of single-source shortest path (SSSP) computation in a distributed setting, where a large sparse graph with non-negative edge weights is partitioned across the nodes of a parallel system. SSSP is a key computation arising in large-scale network analysis and a possible candidate for inclusion in the Graph500 benchmark. Work-efficient SSSP algorithms are based on Dijkstra’...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005